An Upper Bound on the Entropy Series
نویسنده
چکیده
where 0 log 0 is taken as 0. Assume that the p~ are nonincreasing in n (reordering of the p~ does not affect H) . In a recent paper, Keilson (1971) showed that a sufficient condition for the series in (1) to be summable is that oo (i) Z1 P~ log n < ~ and (ii) P,.k ~ 1 / kp , as n ~ ~ for all fixed h = 1, 2 , . . . . I t will follow from the results given here that condition (i) alone is sufficient as well as necessary. Our main result is an upper bound on the entropy series (1) in terms of expectation of certain functions of the random variable X, where X takes the value n with probabi l i ty p~ (n = 1, 2,...).
منابع مشابه
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn Entropy-Based Approach for Evaluating Travel Time Predictability Based on Vehicle Trajectory Data
With the great development of intelligent transportation systems (ITS), travel time prediction has attracted the interest of many researchers, and a large number of prediction methods have been developed. However, as an unavoidable topic, the predictability of travel time series is the basic premise for travel time prediction, which has received less attention than the methodology. Based on the...
متن کاملAn Upper Bound Approach for Analysis of Hydroforming of Sheet Metals
Considering a kinematical velocity admissible field, the upper bound method has beenused for predicting the amount of pressure in hydroforming of sheet metals. The effects of workhardening, friction and blank size have been considered in pressure prediction. Also the effect ofsheet thickness variation has been considered in the present work formulations. The relation betweenpressure and punch s...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملA generalized upper bound solution for bimetallic rod extrusion through arbitrarily curved dies
In this paper, an upper bound approach is used to analyze the extrusion process of bimetallic rods through arbitrarily curved dies. Based on a spherical velocity field, internal, shearing and frictional power terms are calculated. The developed upper bound solution is used for calculating the extrusion force for two types of die shapes: a conical die as a linear die profile and a streamlined di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Information and Control
دوره 20 شماره
صفحات -
تاریخ انتشار 1972